Generic Global Rigidity
نویسنده
چکیده
Suppose a finite configuration of labeled points p = (p1, . . . , pn) inEd is given along with certain pairs of those points determined by a graph G such that the coordinates of the points of p are generic, i.e., algebraically independent over the integers. If another corresponding configuration q = (q1, . . . , qn) in Ed is given such that the corresponding edges of G for p and q have the same length, we provide a sufficient condition to ensure that p and q are congruent in Ed . This condition, together with recent results of Jackson and Jordán [JJ], give necessary and sufficient conditions for a graph being generically globally rigid in the plane.
منابع مشابه
Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space (R with a metric of indefinite signature). We show that a graph is generically globally rigid in Euclidean space iff it is generically globally rigid in a complex or pseudo-Euclidean space. We also establish that global rig...
متن کاملThe Rigidity of New Classes of Graphs
We examine the generic local and global rigidity of various graphs in R. We analyze two classes of graphs that satisfy Hendrickson’s conditions for generic global rigidity, yet fail to be generically globally rigid. We find a large family of bipartite graphs with d > 3, and we use a method that generates infinitely many graphs in R. Finally, we state some conjectures for further exploration.
متن کاملOn the universal rigidity of generic bar frameworks
In this paper, we present a sufficient condition for the universal rigidity of a generic bar framework G(p) in terms of the Gale matrix Z corresponding to G(p). We also establish a relationship between the stress matrix S and the Gale matrix Z for bar frameworks. This allows us to translate back and forth between S and Z in recently obtained results concerning universal rigidity, global rigidit...
متن کاملOn Global Rigidity and Universal Rigidity of Generic Bar Frameworks with Few Vertices
Gale transform was successfully used to classify polytopes with few vertices; that is, r-dimensional polytopes with r + k vertices, where k is small. In this paper, we use Gale transform to classify r-dimensional generic bar frameworks with r + k vertices, where k ≤ 4; as universally rigid, globally rigid or nonglobally rigid.
متن کاملThe 2-dimensional rigidity of certain families of graphs
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and exploited by L. Lovász and Y. Yemini. Global rigidity has only recently been characterized by a combination of two results due to T. Jordán and the first named author, and R. Connelly, respectively. We use these characteriza...
متن کاملOperations Preserving Global Rigidity of Generic Direction-Length Frameworks
A two-dimensional direction-length framework is a pair (G, p), where G = (V ;D,L) is a graph whose edges are labeled as ‘direction’ or ‘length’ edges, and a map p from V to R. The label of an edge uv represents a direction or length constraint between p(u) and p(v). The framework (G, p) is called globally rigid if every other framework (G, q) in which the direction or length between the endvert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 33 شماره
صفحات -
تاریخ انتشار 2005